one of the most important parameters in evaluating a watermarking algorithm is its capacity. generally, watermarking capacity is expressed by bits per pixel (bpp) unit measure. but this measure does not show what the side effects would be on image quality, watermark robustness and capacity. in this paper we propose a three dimensional measure named capacity surface which shows the effects of ca...

One of the most important parameters in evaluating a watermarking algorithm is its capacity. Generally, watermarking capacity is expressed by bits per pixel (bpp) unit measure. But this measure does not show what the side effects would be on image quality, watermark robustness and capacity. In this paper we propose a three dimensional measure named Capacity surface which shows the effects of ca...

We consider the information theoretical capacity of the network flow watermarking problem. Finding capacity bounds of the watermarking problem can lead to compare different watermarking schemes and help in designing more efficient network flow watermarks.

In most watermarking schemes for copyright protection, a seller always knows the embedded watermark identifying a buyer. However, it incurs both repudiation issue and framing issue. To solve these problems, many watermarking protocols have been proposed based on watermarking schemes in the encrypted domain. In this paper, we enhance an existing watermarking scheme and discuss public key cryptos...

Digital watermarking is a technology which potentially can be used to enforce the copyrights and integrity of digital multimedia data. In this paper, a communications perspective on digital watermarking is used to compute upper performance limits on blind digital watermarking for simple AWGN attacks and attacks by amplitude scaling and additive white noise. We show that the latter case can be t...

Watermarking algorithms provide a way of hiding or embedding some bits of information in a watermark. In the case of watermarking a 3D model, many algorithms employ a so-called indexed localization scheme. In this paper, we propose an optimization framework with two new steps for such watermarking algorithms to improve their capacity and invisibility. The first step is to find an optimal layout...

Image watermarking is an important aspect of the security of data. The robustness of watermarking and the capacity of the watermarking process are the main research area for researcher. The watermarking including encryption technique is the main aim of this paper. Discrete Wavelet Transform has been used for the watermarking and PN sequence based random sequence is used for the encryption of th...

An information–theoretic analysis of watermarking is presented in this paper. We formulate watermarking as a communication problem with side information at the encoder and decoder and determine the hiding capacity, which upper–bounds the rates of reliable transmission and quantifies the fundamental tradeoff between three quantities: the achievable watermarking rates and the allowed distortion l...

Our objective is to nd a theoretical watermarking capacity bound of digital images based on domain-speci c masking e ects. In this paper, we rst show the capacity of private watermarking in which the power constraints are not uniform. Then, we apply several domain-speci c Human Vision System approximation models to estimate the power constraints and then show the theoretical watermarking capaci...

Capacity is one of the most important parameters in image watermarking. Different works have been done on this subject with different assumptions on image and communication channel. However, there is not a global agreement to estimate watermarking capacity. In this paper, we suggest a method to find the capacity of images based on their complexities. We propose a new method to estimate image co...